package net.lee.algorithm.tree;

public class TreeNode {

    private String value;

    private TreeNode leftNode;

    private TreeNode rightNode;

    private TreeNode parentNode;

    public TreeNode()
    {

    }

    public TreeNode(Integer value)
    {

    }

    public TreeNode(String value,TreeNode leftNode,TreeNode rightNode)
    {
        this.value=value;
        this.leftNode = leftNode;
        this.rightNode = rightNode;
    }

    public TreeNode(String value, TreeNode leftNode, TreeNode rightNode, TreeNode parentNode) {
        this.value = value;
        this.leftNode = leftNode;
        this.rightNode = rightNode;
        this.parentNode = parentNode;
    }

    public String getValue() {
        return value;
    }

    public void setValue(String value) {
        this.value = value;
    }

    public TreeNode getLeftNode() {
        return leftNode;
    }

    public void setLeftNode(TreeNode leftNode) {
        this.leftNode = leftNode;
    }

    public TreeNode getRightNode() {
        return rightNode;
    }

    public void setRightNode(TreeNode rightNode) {
        this.rightNode = rightNode;
    }

    public TreeNode getParentNode() {
        return parentNode;
    }

    public void setParentNode(TreeNode parentNode) {
        this.parentNode = parentNode;
    }
}
